On bounded functions with bounded $n$th differences
نویسندگان
چکیده
منابع مشابه
Extension of functions with bounded finite differences
In 1934, Whitney posed the problem of how to recognize whether a function f defined on a closed subset X of R is the restriction of a function of class C. Whitney himself solved the one-dimensional case (i.e., for n = 1) in terms of finite differences [W1, W2, W3], giving the classical Whitney’s extension theorem. A geometrical solution for the case C(R) was given by G. Glaeser [G], who introdu...
متن کاملBounded Holomorphic Functions on Bounded Symmetric Domains
Let D be a bounded homogeneous domain in C , and let A denote the open unit disk. If z e D and /: D —► A is holomorphic, then ß/(z) is defined as the maximum ratio \Vz(f)x\/Hz(x, 3c)1/2 , where x is a nonzero vector in C and Hz is the Bergman metric on D . The number ßf(z) represents the maximum dilation of / at z . The set consisting of all ß/(z), for z e D and /: D —► A holomorphic, is known ...
متن کاملOn Bounded Analytic Functions
The objective of this paper is to give an alternative derivation of results on bounded analytic functions recently obtained by Ahlfors [l] and Garabedian [2].1 While it is admitted that the main idea to be used is more in the nature of a lucky guess than of a method, it will be found that the gain in brevity and simplicity of the argument is considerable. As a by-product, we shall also obtain a...
متن کاملOn the generalization of Trapezoid Inequality for functions of two variables with bounded variation and applications
In this paper, a generalization of trapezoid inequality for functions of two independent variables with bounded variation and some applications are given.
متن کاملOn Graphs with Characteristic Bounded-Width Functions
Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic Boolean function. The latter is said to have bounded width b if its minimal-size complete OBDD has bounded width b. Bounded-width functions have small OBDDs and allow efficient functional operations. Therefore, they are of interest in the analysis of symbolic graph algorithms. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1959
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1959-0106969-3